Verifying Whiley Programs with Boogie

Abstract The quest to develop increasingly sophisticated verification systems continues unabated. Tools such as Dafny, Spec#, ESC/Java, SPARK Ada and Whiley attempt seamlessly integrate specification into a programming language, in similar way type checking. A common integration approach is generate conditions that are handed off an automated theorem prover. This provides nice separation of concerns allows different provers be used interchangeably. However, generating still difficult undertaking the use more “high-level” intermediate languages has become commonplace. In particular, Boogie widely understood language. difficulty potential for impedance mismatch between source language this paper, we explore verifying programs Whiley. noteworthy because (amongst other things) rich system with considerable mismatch. We provide comprehensive account translating which demonstrates it possible model most aspects Key challenges posed by included: encoding Whiley’s expressive support flow typing generics; implicit assumption expressions specifications well defined; ability invoke methods from within expressions; return multiple values function or method; presence unrestricted lambda functions; limited syntax framing. demonstrate resulting tool can verify significantly than native verifier was custom-built verification. Furthermore, our work evidence (for part) sufficiently general act wide range languages.